Stochastic Stability of Queueing Networks*
نویسندگان
چکیده
This paper investigates geometric stability and L p-stability of discrete-time Markov chains associated with closed and open queueing networks with Markovian routing. By geometric stability (resp. L p-stability) we mean that the chain is re-generative in the Harris-recurrent sense and that the times between the successive regeneration points have a bounded moment generating function (resp. a bounded pth moment). We show that the closed queueing networks are geometrically stable (resp. L p-stable) if the service times have a bounded moment generation function (resp. a bounded pth moment), and that the open queueing networks are geometrically stable (resp. L p-stable) if the service times have a bounded moment generating function (resp. a bounded maxfp; 2g-th moment) and the interarrival times have a bounded second moment (resp. a bounded pth moment).
منابع مشابه
Robust stability of stochastic fuzzy impulsive recurrent neural networks with\ time-varying delays
In this paper, global robust stability of stochastic impulsive recurrent neural networks with time-varyingdelays which are represented by the Takagi-Sugeno (T-S) fuzzy models is considered. A novel Linear Matrix Inequality (LMI)-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of uncertain fuzzy stochastic impulsive recurrent neural...
متن کاملInstability in Stochastic and Fluid Queueing Networks
The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence (stability) of a corresponding stochastic queueing network, and weak stability implies rate stability of a corresponding stochastic network. These results ha...
متن کاملAlgorithmic challenges in the theory of queueing networks
The theory of queueing systems is traditionally considered as a branch of applied probability. Hence the toolkit used in the analysis of queueing system draws heavily on the theory of stochastic processes. Many problems in the area of queueing networks, however, are of algorithmic nature, and thus require algorithmic/complexity theoretic approaches. In this tutorial we will discuss several such...
متن کاملStochastic Processing Networks
Stochastic processing networks arise as models in manufacturing, telecommunications, transportation, computer systems, the customer service industry and biochemical reaction networks. Common characteristics of these networks are that they have entities, such as jobs, packets, vehicles, customers or molecules, that move along routes, wait in buffers, receive processing from various resources, an...
متن کاملV-uniform ergodicity for state-dependent single class queueing networks
We consider single class queueing networks with state-dependent arrival and service rates. Under the uniform (in state) stability condition, it is shown that the queue length process is V -uniformly ergodic; that is, it has a transition probability kernel which converges to its limit geometrically quickly in V -norm sense. Among several asymptotic properties of V -uniformly ergodic processes, w...
متن کاملPathwise comparison results for stochastic fluid networks
We prove some new pathwise comparison results for single class stochastic fluid networks. Under fairly general conditions, monotonicity with respect to the (stateand time-dependent) routing matrices is shown. Under more restrictive assumptions, monotonicity with respect to the service rates is shown as well. We conclude by using the comparison results to establish a moment bound, a stability re...
متن کامل